Set Propagation Techniques for Reachability Analysis

Reachability analysis consists in computing the set of states that are reachable by a dynamical system from all initial and for admissible inputs parameters. It is fundamental problem motivated many applications formal verification, controller synthesis, estimation, to name only few. This article focuses on class methods guaranteed overapproximation continuous hybrid systems, relying predominantly propagation; starting states, these techniques iteratively propagate sequence sets according dynamics. After review representation computation, presents state art propagation reachability linear, nonlinear, systems. ends with discussion successful real-world problems.